Solving the Generalized Quadratic Multiple Knapsack Problem by Using F-msg Algorithm
نویسندگان
چکیده
The quadratic multiple knapsack problem (QMKP) is a generalization of the quadratic knapsack problem from a single knapsack to k knapsacks. In this study, the mathematical model of the QMKP is generalized as covering the constraints that we may face in real life problems. A new hybrid algorithm which combines F-MSG algorithm and genetic algorithm is proposed to solve the Generalized QMKP (GQMKP). The performance of the F-MSG is analyzed and compared by using randomly generated test instances.
منابع مشابه
The Performance of the Modified Subgradient Algorithm on Solving the 0-1 Quadratic Knapsack Problem
In this study, the performance of the modified subgradient algorithm (MSG) to solve the 0-1 quadratic knapsack problem (QKP) is examined. The MSG is proposed by Gasimov for solving dual problems constructed with respect to sharp Augmented Lagrangian function. The MSG has some important proven properties. For example, it is convergent, and it guarantees the zero duality gap for the problems such...
متن کاملAPPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING
In this paper, an interesting and easy method to solve the multi-dimensional knapsack problem is presented. Although it belongs to the combinatorial optimization, but the proposed method belongs to the decision making field in mathematics. In order to, initially efficiency values for every item is calculated then items are ranked by using Multiple Criteria Decision Making (MCDA). Finally, ite...
متن کاملSolving the Quadratic Knapsack Problem Using the Linearized Version of the Msg Algorithm
24th Mini EURO Conference “Continuous Optimization and Information-Based Technologies in the Financial Sector” (MEC EurOPT 2010) June 23–26, 2010, Izmir, TURKEY ISBN 978-9955-28-598-4 R. Kasımbeyli, C. Dinçer, S. Özpeynirci and L. Sakalauskas (Eds.): MEC EurOPT 2010 Selected papers. Vilnius, 2010, pp. 190–194 © Izmir University of Economics, Turkey, 2010 © Vilnius Gediminas Technical University...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کامل